Arc–transitive Non–cayley Graphs from Regular Maps
نویسنده
چکیده
We prove that the underlying graphs of p-gonal r-valent orientably regular maps are arc-transitive but non-Cayley if r ≥ 3 and p is a prime greater than r(r − 1).
منابع مشابه
On symmetries of Cayley graphs and the graphs underlying regular maps
By definition, Cayley graphs are vertex-transitive, and graphs underlying regular or orientably-regular maps (on surfaces) are arc-transitive. This paper addresses questions about how large the automorphism groups of such graphs can be. In particular, it is shown how to construct 3-valent Cayley graphs that are 5-arc-transitive (in answer to a question by Cai Heng Li), and Cayley graphs of vale...
متن کاملArc { Transitive Non { Cayley Graphs from Regular
We prove that the underlying graphs of p-gonal r-valent orientably regular maps are arc-transitive but non-Cayley if r 3 and p is a prime greater than r(r ? 1).
متن کاملFinite Edge-transitive Cayley Graphs and Rotary Cayley Maps
This paper aims to develop a theory for studying Cayley graphs, especially for those with a high degree of symmetry. The theory consists of analysing several types of basic Cayley graphs (normal, bi-normal, and corefree), and analysing several operations of Cayley graphs (core quotient, normal quotient, and imprimitive quotient). It provides methods for constructing and characterising various c...
متن کاملFINITE s-ARC TRANSITIVE CAYLEY GRAPHS AND FLAG-TRANSITIVE PROJECTIVE PLANES
In this paper, a characterisation is given of finite s-arc transitive Cayley graphs with s ≥ 2. In particular, it is shown that, for any given integer k with k ≥ 3 and k 6= 7, there exists a finite set (maybe empty) of s-transitive Cayley graphs with s ∈ {3, 4, 5, 7} such that all s-transitive Cayley graphs of valency k are their normal covers. This indicates that s-arc transitive Cayley graphs...
متن کاملCayley graphs and coset diagrams
Let G be a finite group, and X a subset of G. The Cayley graph of G with respect to X , written Cay(G,X) has two different definitions in the literature. The vertex set of this graph is the group G. In one definition, there is an arc from g to xg for all g ∈ G and x ∈ X ; in the other definition, for the same pairs (g,x), there is an arc from g to gx. Cayley graphs are generalised by coset grap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994